Dictatorial domains in preference aggregation

نویسندگان

  • Ugur Ozdemir
  • M. Remzi Sanver
چکیده

We call a domain of preference orderings “dictatorial" if there exists no Arrovian (Pareto optimal, IIA and non-dictatorial) social welfare function defined over that domain. In a finite world of alternatives where indifferences are ruled out, we identify a condition which implies the dictatoriality of a domain. This condition –to which we refer as “being essentially saturated”is fairly weak. In fact, independent of the number of alternatives, there exists an essentially saturated (hence dictatorial) domain which consists of precisely six orderings. Moreover, this domain exhibits the superdictatoriality property, i.e., every superdomain of it is also dictatorial. Thus, given m alternatives, the ratio of the size of a superdictatorial domain to the size of the full domain may be as small as 6 / m! – converging to zero as m increases. * Department of Economics, Istanbul Bilgi University; [email protected] and [email protected] 1 This paper has been presented at the Second World Congress of the Game Theory Society, 5-9 July 2004, Marseille; the Seventh Meeting of the Society for Social Choice and Welfare, 21-25 July 2004, Osaka and the 27 Bosphorus Workshop on Economic Design, 21-28 August 2004, Bodrum. We thank Fuad Aleskerov, Göksel A an, Eyal Beigman, Semih Koray, Levent Kutlu, Francois Maniquet, Ipek Ozkal-Sanver, Pelin Pasin, Alper Nakka and John Weymark for their useful comments. Our participation in these meetings has been possible thanks to the financial support of the Turkish Academy of Sciences and the Faculty of Economic and Administrative Sciences of Bilgi University. Our research is part of a project on Electoral System Design which is financed by Bilgi University Research Fund. Of course, the authors are the sole responsible for all existing errors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Further results on dictatorial domains

This paper generalizes the results in Aswal et al. (2003) on dictatorial domains. This is done in two ways. In the first, the notion of connections between pairs of alternatives in Aswal et al. (2003) is weakened to weak connectedness. This notion requires the specification of four preference orderings for every alternative pair. Domains that are linked in the sense of Aswal et al. (2003) with ...

متن کامل

Random dictatorship domains

A domain of preference orderings is a random dictatorship domain if every strategyproof random social choice function satisfying unanimity defined on the domain, is a random dictatorship. Gibbard (1977) showed that the universal domain is a random dictatorship domain. We investigate the relationship between dictatorial and random dictatorship domains. We show that there exist dictatorial domain...

متن کامل

Aggregation of Non-Binary Evaluations∗

We study an aggregation problem in which a society has to determine its position on each of several issues, based on the positions of the members of the society on those issues. There is a prescribed set of feasible evaluations, i.e., permissible combinations of positions on the issues. The binary case of this problem, where only two positions are allowed on each issue, is by now quite well und...

متن کامل

Extension of Arrow's theorem to symmetric sets of tournaments

Arrow’s impossibility theorem [1] shows that the set of acyclic tournaments is not closed to non dictatorial Boolean aggregation. In this paper we extend the notion of aggregation to general tournaments and we show that for tournaments with four vertices or more any proper symmetric (closed to vertex permutations) subset cannot be closed to non dictatorial monotone aggregation and to non neutra...

متن کامل

Programming social choice in logic: some basic experimental results when profiles are restricted

Social choice theory argues mathematical models and their logical consequences for group decision making based on individuals’ preference orderings axiomatically. The most basic results have been proved in this field are two impossibility results for group decision making. Arrow’s general (im)possibility theorem for preference aggregation procedures, i.e., there is no nondictatorial social welf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Social Choice and Welfare

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2007